BUILDING RANDOM TREES FROM BLOCKS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Building Random Trees from Blocks

Many modern networks grow from blocks. We study the probabilistic behavior of parameters of a blocks tree, which models several kinds of networks. It grows from building blocks that are themselves rooted trees. We investigate the number of leaves, depth of nodes, total path length, and height of such trees. We use methods from the theory of Pólya urns and martingales.

متن کامل

Partial Proof Trees as Building Blocks for a Categorial Grammar

We describe a categorial system (PPTS) based on partial proof trees (PPTs) as the building blocks of the system. The PPTs are obtained by unfolding the arguments of the type that would be associated with a lexical item in a simple categorial grammar. The PPTs are the basic types in the system and a derivation proceeds by combining PPTs together. We describe the construction of the nite set of b...

متن کامل

Building Cartesian Trees from Free Trees

One can build a Cartesian tree from an n-element sequence in O(n) time, and from an n-node free tree in O(n log n) time (with a matching worst-case lower bound in the comparison model of computation). We connect these results together by describing an “adaptive” Cartesian tree construction algorithm running in O(n log k) time on a free tree with k leaves. We also provide a matching worst-case l...

متن کامل

Building Graphs from Colored Trees

We will explore the computational complexity of satisfying certain sets of neighborhood conditions in graphs with various properties. More precisely, fix a radius ρ and let N(G) be the set of isomorphism classes of ρ-neighborhoods of vertices of G where G is a graph whose vertices are colored (not necessarily properly) by colors from a fixed finite palette. The root of the neighborhood will be ...

متن کامل

Building Digital Libraries from Simple Building Blocks Authors

Metadata harvesting has been established by the Open Archives Initiative (OAI) as a viable mechanism for connecting a provider of data to a purveyor of services. The Open Digital Library (ODL) model is an emerging framework which attempts to break up the services into appropriate components based also on the basic philosophy of the OAI model. This framework has been applied to various projects ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Probability in the Engineering and Informational Sciences

سال: 2013

ISSN: 0269-9648,1469-8951

DOI: 10.1017/s0269964813000338